Virtual Network Construction with K-Shortest Path Algorithm and Prim’s MST Algorithm for Robust Physical Networks

Network virtualization has attracted considerable attention currently, and it has been expected to be utilized as new-generation network technology. For the network virtualization, improved network robustness is indispensable for virtual networks and a physical network. Moreover, it is important to utilize network resources in the physical network and construct a lot of virtual networks. In this paper, we propose a new virtual network construction so as to construct a lot of virtual networks. Our proposed method utilizes K-shortest path algorithm and Prim’s MST algorithm. At first, in the proposed method, K topologies of virtual networks are designed by using the K-shortest path algorithm and the Prim’s MST algorithm instead of the KMB algorithm. Because many topologies are designed, it is expected that a request of constructing a virtual network can be accepted with a high probability. We evaluate the performance of our proposed method for three different topologies with simulation. We investigate the effectiveness of our proposed method by comparing this method with the conventional method. In addition, we evaluate the computation time of the K-shortest path algorithm. In numerical examples, we show that our proposed method is effective in a large-scale backbone network.